Multipliers and Datapaths
نویسندگان
چکیده
People traditionally have considered the number of counters in the critical path as the met ric for the performance of a multiplier This report presents the view that tree topologies which have the least number of levels do not always give the fastest possible multiplier when constrained to be part of a microprocessor It proposes two new topologies hybrid struc ture and higher order arrays which are faster than conventional tree topologies for typical datapaths
منابع مشابه
Designing coarse-grain reconfigurable architectures by inlining flexibility into custom arithmetic data-paths
This paper introduces a design technique for coarse-grained reconfigurable architectures targeting digital signal processing (DSP) applications. The design procedure is analyzed in detail and an areatime-power efficient reconfigurable kernel architecture is presented. The proposed technique inlines flexibility into custom carry-save (CS) arithmetic datapaths exploiting a stable and canonical in...
متن کاملComparative Analysis of Sectoral Multipliers of Input-Output Model and Social Accounting Matrix
The present study is to indicate that the comparison between sectoral production multipliers of an input-output (I/O) model and a social accounting matrix (SAM) framework is almost impossible without taking into account accounting balances and theoretical considerations. Theoretically, the I/O model provides the Leontief’s production function, on the basis of which sectoral output multiplier ca...
متن کاملMULTIPLIERS AND THEIR APPLICATIONS IN EARTHQUAKE ENGINEERING
In this paper we shall study the multipliers on Banach algebras and We prove some results concerning Arens regularity and amenability of the Banach algebra M(A) of all multipliers on a given Banach algebra A. We also show that, under special hypotheses, each Jordan multiplier on a Banach algebra without order is a multiplier. Finally, we present some applications of m...
متن کاملBehavior-RTL Equivalence Checking Based on Data Transfer Analysis with Virtual Controllers and Datapaths
A behavior-RTL equivalence checking method based on bottom-up reasoning is presented. Behavior and RTL descriptions are converted into dependence graphs from which virtual controllers/datapaths are generated. Actual equivalence checking is based on isomorphism analysis on dependence graphs and also virtual controllers/datapaths. First equivalence classes on partial computations are extracted by...
متن کاملEfficient Integration of Pipelined IP Blocks into Automatically Compiled Datapaths
Compilers for reconfigurable computers aim to generate problem-specific optimized datapaths for kernels extracted from an input language. In many cases, however, judicious use of preexisting manually optimized IP blocks within these datapaths could improve the compute performance even further. The integration of IP blocks into the compiled datapaths poses a different set of problems than stitch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994